The Geo/Ga,Y/1/N Queue Revisited
نویسندگان
چکیده
We not only present an alternative and simpler approach to find steady-state distributions of the number jobs for finite-space queueing model Geo/Ga,Y/1/N using roots inherent characteristic equation, but also correct errors in some published papers. The server has a random service capacity Y, it processes when system is at least ‘a’, threshold value. main advantage this process that gives unified dealing with both finite- infinite-buffer systems. queue-length distribution obtained departure epochs. derive relation between discrete-time queue its continuous-time analogue. Finally, we deal performance measures numerical results.
منابع مشابه
The G/M/1 queue revisited
The G/M/1 queue is one of the classical models of queueing theory. The goal of this paper is two-fold: (i) To introduce new derivations of some well-known results, and (ii) to present some new results for the G/M/1 queue and its variants. In particular, we pay attention to the G/M/1 queue with a set-up time at the start of each busy period, and the G/M/1 queue with exceptional first service. Fo...
متن کاملThe M/G/1+G queue revisited
We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balks or reneges when its virtual waiting time, i.e., the amount of work seen upon arrival, is larger than a certain random patience time. We consider the number of customers in the system, the maximum workload during a busy period, and the length of a busy period. We also briefly treat the analogous...
متن کاملThe Discrete-Time Gated Vacation Queue Revisited
We consider the discrete-time gated multiple-vacation queue. Vacations are modeled as independent random variables with distributions depending on the number of the immediately preceding vacations. Using a probability generating function approach, we focus on various performance measures such as moments of queue contents and customer delay in equilibrium. These measures are functions of a const...
متن کاملDeducing Queueing from Transactional Data: The Queue Inference Engine, Revisited
Larson [1] proposed a method to statistically infer the expected transient queue length during a busy period in 0(n 5) solely from the n starting and stopping times of each customer's service during the busy period and assuming the arrival distribution is Poisson. We develop a new O(n 3) algorithm which uses this data to deduce transient queue lengths as well as the waiting times of each custom...
متن کاملThe Discrete-Time Queue with Geometrically Distributed Service Capacities Revisited
We analyze a discrete-time queue with variable service capacity, such that the total amount of work that can be performed during each time slot is a stochastic variable that is geometrically distributed. We study the buffer occupancy by constructing an analogous model with fixed service capacity. In contrast with classical discrete-time queueing models, however, the service times in the fixed-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10173142